NUCLEAR: An Efficient Methods for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
نویسندگان
چکیده
منابع مشابه
Efficient Vertical Mining of Frequent Closed Itemsets and Generators
The effective construction of many association rule bases require the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, these two tasks are rarely combined. Most of the existing solutions apply levelwise breadth-first traversal, though depth-first traversal is knowingly superior. Hence, we address here the depth-first FCI/FG-mining. The proposed algorithm,...
متن کاملCLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets
Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have proposed an interesting alternative: mining frequent closed itemsets and their corresponding rules, which has the same power as association mining but substantially reduces the number of rules to be presented. In this paper, we propose an e cient algorithm, CLOSET, for mi...
متن کاملFrequent Itemsets Mining: An Efficient Graphical Approach
Recent advances in computer technology in terms of speed, cost, tremendous amount of computing power and decrease data processing time has spurred increased interest in data mining applications to extract useful knowledge from data. Over the last couple of years, data mining technology has been successfully employed to various business domains and scientific areas. Various data mining technique...
متن کاملMining frequent closed itemsets out-of-core
Extracting frequent itemsets is an important task in many data mining applications. When data are very large, it becomes mandatory to perform the mining task by using an external memory algorithm, but only a few of these algorithms have been proposed so far. Since also the result set of all the frequent itemsets is likely to be undesirably large, condensed representations, such as closed itemse...
متن کاملMining Frequent Closed Itemsets without Duplicates Generation
Closed itemsets are semantically equivalent to frequent itemsets but are orders of magnitude fewer, thus allowing the knowledge extracted from a transactional database to be represented very concisely. Unfortunately, no algorithm has been yet devised which allows to mine closed patterns directly. All existing algorithms may in fact generate the same closed itemset multiple times, and need to ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMATION TECHNOLOGY IN INDUSTRY
سال: 2021
ISSN: 2203-1731
DOI: 10.17762/itii.v7i2.65